package com.zk.lettcode;

import java.util.HashMap;
import java.util.Map;
import java.util.Stack;

/**
 * 并两个有序链表
 * 递归实现排序
 * @Author: zhang kai
 * @Date: 2021/11/11
 * @Description: https://leetcode-cn.com/problems/merge-two-sorted-lists/
 */
public class Practice7 {

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if (l1 == null) {
            return l2;
        } else if (l2 == null) {
            return l1;
        } else if (l1.val < l2.val){
            l1.next = mergeTwoLists(l1.next, l2);
            return l1;
        } else {
            l2.next = mergeTwoLists(l1, l2.next);
            return l2;
        }
    }



}
